Civil Rights
Movements, leaders, victories and the continuing fight for equality.
q2K BHP
Black History Portal
THE BHP WIRE —
HIDDEN TRUTHS
What's New!
Explore the people, places, events, achievements, struggles and stories that shaped our journey.
Movements, leaders, victories and the continuing fight for equality.
Innovation, patents, science, technology and world-changing contributions.
Pioneers, champions, Negro Leagues, records, activism and excellence.
Meet the people whose lives, choices and achievements shaped the journey.
Black towns, communities, institutions and places where history happened.
Moments that changed communities, movements, institutions and the nation.
Katherine Johnson’s mathematical calculations helped guide some of America’s most important early space missions while she confronted the racial and gender barriers faced by Black women in twentieth-century America.
MORE →Reflects the personal views, recollections, and perspective of the author, Mike Davis.
This is a personal recollection on the Move fire on May 13, 1985
| Deep Rooted Tree | |
|---|---|
 Promotional poster | |
| Also known as | Tree with Deep Roots |
| Hangul | 뿌리 깊은 나무 |
| RR | Ppuri gipeun namu |
| MR | Ppuri kip'ŭn namu |
| Genre | Historical Mystery Romance |
| Created by | Koo Bon Geun (SBS Drama Headquarters) |
| Based on | Deep Rooted Tree by Lee Jung-myung |
| Written by | Kim Young-hyun Park Sang-yeon |
| Directed by | Jang Tae-yoo |
| Starring | Han Suk-kyu Jang Hyuk Shin Se-kyung |
| Composer | Jeon Changyeop |
| Country of origin | South Korea |
| Original language | Korean |
| No. of episodes | 24 |
| Production | |
| Executive producer | Choi Moon Seok (SBS Drama Operation Team) |
| Producers | Kyung Min seok Lee Young jun Jung Hoon-tak Jang Jin-wook |
| Production location | Korea |
| Running time | Wednesdays and Thursdays at 21:55 (KST) |
| Production company | iHQ |
| Original release | |
| Network | SBS |
| Release | 5 October – 22 December 2011 |
| Related | |
| Six Flying Dragons | |
Deep Rooted Tree (Korean: 뿌리 깊은 나무; RR: Ppuri gipeun namu) is a 2011 South Korean television series starring Han Suk-kyu, Jang Hyuk and Shin Se-kyung. Based on the novel of the same name by Lee Jung-myung, it aired on SBS from 5 October to 22 December 2011 on Wednesdays and Thursdays at 21:55 for 24 episodes.
Taking its name from the poem Yongbieocheonga that says that trees with deep roots do not sway, the series tells the story of a royal guard (played by Jang Hyuk) investigating a case involving the serial murders of Jiphyeonjeon scholars in Gyeongbokgung while King Sejong (played by Han Suk-kyu, in his TV comeback after 16 years of solely film work) comes to create the Korean alphabet.[1][2]
Early in his reign, King Sejong inevitably causes the death of his in-laws and their slaves in an attempt to save them from his brutal father, King Taejong, mainly due to his lack of authority and power. Two young slaves, Ddol-bok and his friend Dam, survive but neither knows if the other has. Ddol-bok blames the king and vows to kill him to avenge the deaths of everyone he loved and spends years becoming a great warrior. Dam, who has a photographic memory, becomes a court lady called So-yi (Shin Se-kyung), but she feels so guilty about her role in the other slaves' deaths that she becomes mute.
Ddol-bok returns to the palace under the name of Kang Chae-yoon (Jang Hyuk) to kill the king. However, during his time there, he becomes embroiled in the mystery surrounding the deaths of several Hall of Worthies scholars. The deaths were caused by a secret society called "Hidden Root," which was created long ago by followers of Jeong Do-jeon, with the goal of giving more power to ministers and less to the king. King Taejong killed Jeong Do-jeon and all of his family except his nephew, Jeong Gi-joon, who is now the leader of Hidden Root and lives in disguise not far from King Sejong.
It soon becomes known that the king, with the help of So-yi and the Hall of Worthies scholars, has been working for years on a secret project, which turns out to be the creation of the Korean alphabet. While tracking Hidden Root, Kang Chae-yoon and So-yi each realizes who the other really is - Ddol-bok and Dam. Realizing that each other are the ones who they were dying to find, So-yi begins to speak. So-yi shows Chae-yoon the alphabet and describes how it will give more power to commoners. Chae-yoon is amazed with the simplicity of the alphabet and is convinced to work with the king instead of killing him.
However, Jeong Gi-joon believes that the new alphabet is a threat to Confucian order, and decides to stop it at all costs. He murders the king's son, but this only makes Sejong more determined. Jeong is able to stop the king's dissemination efforts, and on the day the alphabet is to be publicly announced, both So-yi and Chae-yoon are fatally wounded by Hidden Root members. However, through their sacrifices, the event is successful, and commoners begin to use Hangul.
| Episode # | Original broadcast date | Average audience share | |||
|---|---|---|---|---|---|
| TNmS Ratings[3] | AGB Nielsen[4] | ||||
| Nationwide | Seoul National Capital Area | Nationwide | Seoul National Capital Area | ||
| 1 | 5 October 2011 | 9.2% | 11.0% | 9.5% | 11.1% |
| 2 | 6 October 2011 | 8.2% | 9.8% | 9.8% | 10.6% |
| 3 | 12 October 2011 | 16.4% | 18.7% | 18.2% | 20.7% |
| 4 | 13 October 2011 | 18.8% | 22.6% | 19.1% | 21.8% |
| 5 | 19 October 2011 | 17.7% | 20.6% | 18.3% | 20.5% |
| 6 | 20 October 2011 | 18.3% | 20.8% | 18.6% | 19.1% |
| 7 | 26 October 2011 | 17.9% | 21.0% | 18.9% | 20.1% |
| 8 | 27 October 2011 | 18.3% | 20.5% | 19.2% | 20.5% |
| 9 | 2 November 2011 | 17.3% | 19.2% | 17.4% | 18.9% |
| 10 | 3 November 2011 | 18.5% | 20.7% | 20.2% | 22.1% |
| 11 | 9 November 2011 | 17.9% | 20.3% | 19.1% | 20.4% |
| 12 | 10 November 2011 | 18.9% | 20.9% | 19.9% | 21.3% |
| 13 | 16 November 2011 | 18.7% | 21.4% | 19.4% | 20.9% |
| 14 | 17 November 2011 | 19.0% | 21.6% | 20.5% | 22.0% |
| 15 | 23 November 2011 | 17.8% | 20.6% | 20.1% | 21.1% |
| 16 | 24 November 2011 | 19.9% | 21.9% | 21.1% | 22.3% |
| 17 | 30 November 2011 | 18.8% | 20.7% | 21.0% | 22.0% |
| 18 | 1 December 2011 | 18.6% | 21.4% | 20.8% | 22.2% |
| 19 | 7 December 2011 | 20.1% | 23.1% | 21.6% | 23.0% |
| 20 | 8 December 2011 | 20.2% | 23.5% | 21.7% | 23.0% |
| 21 | 14 December 2011 | 19.7% | 22.3% | 21.9% | 23.3% |
| 22 | 15 December 2011 | 19.3% | 22.1% | 22.7% | 24.7% |
| 23 | 21 December 2011 | 19.7% | 22.5% | 21.4% | 23.2% |
| 24 | 22 December 2011 | 23.6% | 27.5% | 25.4% | 27.3% |
| Average | 18.0% | 20.6% | 19.4% | 20.9% | |
Source: AGB Nielsen Korea
| Year | Award | Category | Recipient | Result |
|---|---|---|---|---|
| 2011 | Grand Prize (Daesang) | Han Suk-kyu | Won | |
| Best Drama | Deep Rooted Tree | Won | ||
| Top Excellence Award, Actor in a Drama Special | Han Suk-kyu | Nominated | ||
| Excellence Award, Actress in a Drama Special | Shin Se-kyung | Won | ||
| Special Award, Actor in a Drama Special | Cho Jin-woong | Nominated | ||
| Special Award, Actress in a Drama Special | Song Ok-sook | Won | ||
| Producer's Choice Award | Song Joong-ki | Won | ||
| Top 10 Stars | Han Suk-kyu | Won | ||
| Jang Hyuk | Won | |||
| 2012 | 6th Mnet 20's Choice Awards | 20's Male Drama Star | Song Joong-ki | Nominated |
| 20's Female Drama Star | Shin Se-kyung | Nominated | ||
| 7th Seoul International Drama Awards | Grand Prize | Deep Rooted Tree | Won | |
| Best Screenwriter | Kim Young-hyun, Park Sang-yeon | Nominated | ||
| Outstanding Korean Drama | Deep Rooted Tree | Nominated | ||
| Outstanding Korean Actress | Shin Se-kyung | Nominated | ||
| Grand Prize (Daesang) for TV | Deep Rooted Tree | Won | ||
| Best TV Drama | Deep Rooted Tree | Nominated | ||
| Best Actor (TV) | Han Suk-kyu | Nominated | ||
| Best Director (TV) | Jang Tae-yoo | Nominated | ||
| Best Screenplay (TV) | Kim Young-hyun, Park Sang-yeon | Won | ||
| Grand Prize (Daesang) | Han Suk-kyu | Nominated | ||
| Best Director | Jang Tae-yoo | Won | ||
| Excellence Award, Actor | Yoon Je-moon | Nominated | ||
| Top Excellence Award, Actor | Han Suk-kyu | Nominated |
It aired in Japan on KNTV from 24 July to 17 September 2012,[5] which was followed by reruns on terrestrial network TV Tokyo.[6]
It aired in Thailand on Channel 7 every Monday to Thursday at 2.10 a.m. starting 14 January 2016.[7]
It aired in Indonesia on RTV ever Monday to Friday at 7:30 a.m. starring 6 May 2016.
Source: Wikipedia. Article content is retrieved live through the MediaWiki API.
Deep Rooted Tree (Korean: 뿌리 깊은 나무; RR: Ppuri gipeun namu) is a 2011 South Korean television series starring Han Suk-kyu, Jang Hyuk and Shin Se-kyung. Based on the novel of the same name by Lee Jung-myung, it aired on SBS from 5 October to 22 December 2011 on Wednesdays and Thursdays at 21:55 for 24 episodes. Taking its name from the poem Yongbieocheonga that says that trees with deep roots do not sway, the series tells the story of a royal guard (played by Jang Hyuk) investigating a case involving the serial murders of Jiphyeonjeon scholars in Gyeongbokgung while King Sejong (played by Han Suk-kyu, in his TV comeback after 16 years of solely film work) comes to create the Korean alphabet.
In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. That is, it is a k-ary tree where k = 2. A recursive definition using set theory is that a binary tree is a triple (L, S, R), where L and R are binary trees or the empty set and S is a singleton (a single–element set) containing the root. From a graph theory perspective, binary trees as defined here are arborescences. A binary tree may thus be also called a bifurcating arborescence, a term which appears in some early programming books before the modern computer science terminology prevailed. It is also possible to interpret a binary tree as an undirected, rather than directed graph, in which case a binary tree is an ordered, rooted tree. Some authors use rooted binary tree instead of binary tree to emphasize the fact that the tree is rooted, but as defined above, a binary tree is always rooted. In mathematics, what is termed binary tree can vary significantly from author to author. Some use the definition commonly used in computer science, but others define it as every non-leaf having exactly two children and don't necessarily label the children as left and right either. In computing, binary trees can be used in two very different ways: First, as a means of accessing nodes based on some value or label associated with each node. Binary trees labelled this way are used to implement binary search trees and binary heaps, and are used for efficient searching and sorting. The designation of non-root nodes as left or right child even when there is only one child present matters in some of these applications, in particular, it is significant in binary search trees. However, the arrangement of particular nodes into the tree is not part of the conceptual information. For example, in a normal binary search tree the placement of nodes depends almost entirely on the order in which they were added, and can be re-arranged (for example by balancing) without changing the meaning. Second, as a representation of data with a relevant bifurcating structure. In such cases, the particular arrangement of nodes under and/or to the left or right of other nodes is part of the information (that is, changing it would change the meaning). Common examples occur with Huffman coding and cladograms. The everyday division of documents into chapters, sections, paragraphs, and so on is an analogous example with n-ary rather than binary trees.
In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected acyclic undirected graph. A forest is an undirected graph in which any two vertices are connected by at most one path, or equivalently an acyclic undirected graph, or equivalently a disjoint union of trees. A directed tree, oriented tree, polytree, or singly connected network is a directed acyclic graph (DAG) whose underlying undirected graph is a tree. A polyforest (or directed forest or oriented forest) is a directed acyclic graph whose underlying undirected graph is a forest. The various kinds of data structures referred to as trees in computer science have underlying graphs that are trees in graph theory, although such data structures are generally rooted trees. A rooted tree may be directed, called a directed rooted tree, either making all its edges point away from the root—in which case it is called an arborescence or out-tree—or making all its edges point towards the root—in which case it is called an anti-arborescence or in-tree. A rooted tree itself has been defined by some authors as a directed graph. A rooted forest is a disjoint union of rooted trees. A rooted forest may be directed, called a directed rooted forest, either making all its edges point away from the root in each rooted tree—in which case it is called a branching or out-forest—or making all its edges point towards the root in each rooted tree—in which case it is called an anti-branching or in-forest. The term tree was coined in 1857 by the British mathematician Arthur Cayley.
A parse tree or parsing tree (also known as a derivation tree or concrete syntax tree) is an ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar. The term parse tree itself is used primarily in computational linguistics; in theoretical syntax, the term syntax tree is more common. Concrete syntax trees reflect the syntax of the input language, making them distinct from the abstract syntax trees used in computer programming. Unlike Reed-Kellogg sentence diagrams used for teaching grammar, parse trees do not use distinct symbol shapes for different types of constituents. Parse trees are usually constructed based on either the constituency relation of constituency grammars (phrase structure grammars) or the dependency relation of dependency grammars. Parse trees may be generated for sentences in natural languages (see natural language processing), as well as during processing of computer languages, such as programming languages. A related concept is that of phrase marker or P-marker, as used in transformational generative grammar. A phrase marker is a linguistic expression marked as to its phrase structure. This may be presented in the form of a tree, or as a bracketed expression. Phrase markers are generated by applying phrase structure rules, and themselves are subject to further transformational rules. A set of possible parse trees for a syntactically ambiguous sentence is called a "parse forest".
Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.
MORE →Madam C.J. Walker