File: root - text - article - 2019 - 11 - deepest-node-in-a-binary-tree.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 481 Views, 22527 Search Bots | 106 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 481 Views, 22527 Search Bots | 106 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Google:
You are given the root of a binary tree. Return the deepest node (the furthest node from the root).
Example:
The deepest node in this tree is d at depth 3.
Here's a starting point:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 481 Views, 22527 Search Bots | 106 Words You are given the root of a binary tree. Return the deepest node (the furthest node from the root).
Example:
a
/ \
b c
/
d
The deepest node in this tree is d at depth 3.
Here's a starting point:
class Node(object):
def __init__(self, val):
self.val = val
self.left = None
self.right = None
def __repr__(self):
# string representation
return self.val
def deepest(node):
# Fill this in.
root = Node('a')
root.left = Node('b')
root.left.left = Node('d')
root.right = Node('c')
print deepest(root)
# (d, 3)
Related Articles
- [Daily Problem] Course Prerequisites
- Maximum In A Stack
- Daily Interview Problem:Create a balanced binary search tree
- Longest Substring Without Repeating Characters
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Design Tic-Tac-Toe
- Daily Interview Question: Create a Simple Calculator
- Algorithm Interview: Shifted String
- Daily Interview Question: Word Search
- Floor and Ceiling of a Binary Search Tree
©2006~2024 SteakOverCooked - 0.00832 Seconds(s) - 2471.586 KB/s - 32 Online Memory: 493.95 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !