文件: root - text - article - 2020 - 01 - symmetric-k-ary-tree.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 380 次阅读, 21477 次搜索 | 118 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 380 次阅读, 21477 次搜索 | 118 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Microsoft:
A k-ary tree is a tree with k-children, and a tree is symmetrical if the data of the left side of the tree is the same as the right side of the tree.
Here's an example of a symmetrical k-ary tree.
Given a k-ary tree, figure out if the tree is symmetrical.
Here is a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 380 次阅读, 21477 次搜索 | 118 个单词 A k-ary tree is a tree with k-children, and a tree is symmetrical if the data of the left side of the tree is the same as the right side of the tree.
Here's an example of a symmetrical k-ary tree.
4
/ \
3 3
/ | \ / | \
9 4 1 1 4 9
Given a k-ary tree, figure out if the tree is symmetrical.
Here is a starting point:
class Node():
def __init__(self, value, children=[]):
self.value = value
self.children = children
def is_symmetric(root):
# Fill this in.
tree = Node(4)
tree.children = [Node(3), Node(3)]
tree.children[0].children = [Node(9), Node(4), Node(1)]
tree.children[1].children = [Node(1), Node(4), Node(9)]
print is_symmetric(tree)
# True
猜您喜欢...
- Find Pythagorean Triplets
- Daily Interview Problem: Largest Product of 3 Elements I
- Daily Interview Problem: Spiral Traversal of Grid
- Daily Interview Problem: Merge Overlapping Intervals
- Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
- Sort a Partially Sorted List
- Daily Interview Problem: Contiguous Subarray with Maximum Sum
- Daily Interview Problem: Find the k-th Largest Element in a List
- Algorithm Interview: Convert Roman Numerals to Decimal
- Algorithm Interview: No Adjacent Repeating Characters
©2006~2024 牛排过熟 - 0.03011 秒 - 695.557 KB/s - 24 在线 内存: 493.1 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。