I tried a complicated recursive methods and got stuck. If there is no restriction, we actually could use an hash map to store tree nodes while tracing up the parent nodes of the given nodes. if a common node is found to be parent of the given 2 nodes then print it out

Helpful Answer?

Yes | No

Inappropriate?

To comment on this question, Sign In with Facebook or Sign Up

You might also be interested in: Interview Questions, Software Engineer Interview Questions, Symantec Interview

Symantec Overview (SYMC)

Edit

Website www.symantec.com

HQ Mountain View, CA

Industry

Security Software

Size

18,600+ Employees, $5B+ Revenue

Competitors

Microsoft, McAfee, Trend Micro

Interviews by Company

Salaries by Company

Tags are like keywords that help categorize interview questions that have something in common.

About Us | Feedback | Help

Glassdoor ® is a registered trademark of Glassdoor, Inc.

Overview

Salaries

Reviews

Interviews

Photos

Jobs

Connections

87 Interview Reviews |

Interview Question for Software Engineer at Symantec:

find lowest common ancestor of 2 nodes in a binary tree

Answers & Comments (1)

Flag this {0} as inappropriate

Thank you!

Oops!