See All PhotosGoogleEngaged EmployerGoogleAdd an InterviewAbout36KReviews2KJobsMoreOverviewCompany OverviewOrganization StructureFAQ36KReviews2.2KJobs66KSalaries16KInterviews9.4KBenefits585PhotosFollow+Add an InterviewInterview QuestionSoftware Engineer In Test Interview-GoogleImplement a binary tree and explain it's functionAnswerAdd TagsFlag as InappropriateFlag as InappropriateInterview Answers4 Answers▲8▼Hi Xin Li, A binary tree is not the same as binary search tree.. A binary tree is a tree in which every node has atmost two children nodes. It is a k-ary tree in which k=2. A complete binary tree is a tree in which all nodes have the same depth.Anonymous on Jan 11, 2011Flag as InappropriateFlag as Inappropriate▲0▼For the love of god I wish I got a problem this easyAnonymous on Jan 21, 2022Flag as InappropriateFlag as Inappropriate▲4▼Binary Search tree is a storage data structure that allows log(n) insertion time, log(n) search, given a balanced binary search tree. The following implementation assumes an integer bst. There's a million implementations. Just look on wikipedia for search and insert algorithms.Xin Li on May 9, 2009Flag as InappropriateFlag as Inappropriate▲1▼The fact is ttttttt t t. T to t. To. A a aaAs Sdsassss.Anonymous on Aug 24, 2016Flag as InappropriateFlag as InappropriateInterviews>GoogleAdd Answers or CommentsTo comment on this, Sign In or Sign Up. Google CareersWe strive to provide Googlers and their loved ones with a world-class benefits experience, focused on supporting their physical, financial,... – MoreWhere we workBuilding belongingGoogler storiesBuild your future This is the employer's chance to tell you why you should work for them. The information provided is from their perspective.