File: root - text - article - 2020 - 01 - symmetric-k-ary-tree.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 513 Views, 22022 Search Bots | 118 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 513 Views, 22022 Search Bots | 118 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 513 Views, 22022 Search Bots | 118 Words 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
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Fix Brackets
- Daily Interview Problem: Arithmetic Binary Tree
- Algorithm Interview Question: Nth Fibonacci Number
- Daily Interview Problem: Full Binary Tree
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- Maximum In A Stack
- ImageMagick Vulnerabilities - CVE-2016–3714
- Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
- Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
- Algorithm Interview: String Compression
©2006~2024 SteakOverCooked - 0.00703 Seconds(s) - 7764.707 KB/s - 13 Online
Memory: 516.67 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="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !